mine interact behavior email repli order predict context model rank tag bursti featur text stream interv implicit parametr surfac trust trust studi trust reciproc behavior reciproc trust predict probabilist approach person tag recommend messag behavior model mobil social network twitterrank find topic dsensit influenti twitter user behavior model peer dto dpeer file share network dissect download remov action model syntact structur topic nest hmm dlda trust trust predict onlin trust trust anteced framework slide dmode control algorithm simul method time offset estim perform evalu synchron gpp lte downlink adapt learn method face hallucin local preserv project dynam model numer simul particl motion rotat flow field centrifug knowledg transfer multipl model local structur map effect knowledg transfer classif algorithm depend differ distribut gener train exampl test exampl drawn task difficult train exampl domain test domain paper propos local weight ensembl framework combin multipl model transfer learn weight dynam assign model predict power test integr advantag learn algorithm label inform multipl train domain unifi classif model appli domain importantli previous propos method base learn method requir specif design transfer learn show optim local weight ensembl framework gener approach combin multipl model domain transfer propos implement local weight assign map structur model structur test domain weight model local consist neighborhood structur test experiment result text classif spam filter intrus detect data set demonstr signific improv classif accuraci gain framework transfer learn task newsgroup messag categor propos local weight ensembl framework achiev accuraci singl model predict correctli test exampl summari improv accuraci problem algebra soft ddecis decod reed dsolomon code bit dlevel soft inform perform algebra soft decis decod asd reed solomon rs code bit level soft inform investig optim multipl assign strategi ma asd infinit cost studi erasur channel binari symmetr channel bsc decod radii calcul close form tight bound error probabl deriv ma perform analysi gener character decod region asd mix error bit level erasur channel bit level decod region propos ma shown significantli larger convent berlekamp massei bm decod applic bit level gener minimum distanc bgmd decod algorithm propos propos bgmd compar favor rs soft decis decod sdd algorithm channel ow simplic bgmd perform tightli bound order statist instanc weight domain adapt nlp domain adapt import problem natur languag process nlp due lack label data domain paper studi domain adapt problem instanc weight perspect formal analyz character domain adapt problem distribut view show distinct adapt distribut instanc classif function sourc target domain propos gener instanc weight framework domain adapt empir result nlp task show incorpor exploit inform target domain instanc weight effect dstage approach domain adapt statist classifi paper problem adapt statist classifi train sourc domain label exampl target domain label characterist domain adapt problem exampl sourc domain target domain follow distribut regular classif method tend overfit sourc domain present stage approach domain adapt gener stage set featur generaliz domain adapt stage pick featur specif target domain observ exact object function hard optim propos number heurist approxim achiev goal gener adapt experi gene recognit real data set show effect gener framework heurist systemat explor featur space relat extract relat extract task find semant relat entiti text state art method relat extract base statist learn deal featur select significantli affect classif perform paper systemat explor larg space featur relat extract evalu effect featur subspac present gener definit featur space base graphic represent relat instanc explor represent relat instanc featur complex framework experi show basic unit featur gener suffici achiev state art perform overinclus complex featur hurt perform combin featur level complex sentenc represent coupl task orient featur prune perform languag model genom inform retriev uiuc trec genom track gener gene summari biomed literatur studi semi dstructur summar empir studi token strategi biomed inform retriev due great variat biolog name biomed text tok eniz import preprocess step biomed inform retriev de spite import studi evalu tokeniza tion strategi biomed text work conduct care systemat evalu set token heurist trec biomed text collect ad hoc document retriev repres retriev method pseudo relev feedback method studi effect stem stop word remov retriev perform expect experi result show token significantli affect retriev accuraci keniz improv perform measur averag precis map shown queri type requir token heurist stem effect queri stop word remov gener improv retriev perform biomed text simpl paper develop simpl analyt character steadi state throughput function loss rate round trip time bulk transfer tcp flow flow unlimit amount data send unlik model model captur behavior tcp fast retransmit mechan consid effect tcp timeout mechan throughput measur suggest behavior import model perspect tcp trace contain timeout event fast retransmit event measur demonstr model accur predict tcp throughput accur wider rang loss rate materi base work support nation scienc foundat grant ncr ncr cda opinion find conclus recommend express materi author necessarili reflect view nation scienc foundat ddbf improv bloom filter represent method dynam set exploit domain structur name entiti recognit name entiti recognit ner fundament task text mine natur languag understand current approach ner base supervis learn perform domain similar train domain tend adapt poorli slightli domain present strategi exploit domain structur train data learn robust name entiti recogn perform domain propos simpl effect automat rank featur base generaliz domain train classifi strong emphasi generaliz featur emphasi impos put rank base prior logist regress model propos domain awar cross valid strategi choos paramet rank base prior evalu propos method task recogn name entiti gene biologi text involv speci experi result show domainawar approach outperform state ofth art baselin method adapt domain great differ domain train domain automat gener gene summari biomed literatur biologist find inform gene function genom databas search dispar biomed literatur locat relev articl spend consider effort read retriev articl order locat relev knowledg gene describ softwar automat gener gene summari biomed literatur present stage summar method involv retriev relev articl extract inform sentenc retriev articl gener structur gene summari gener summari explicitli cover multipl aspect gene sequenc inform mutant phenotyp molecular interact gene propos heurist approach improv accuraci stage propos method evalu randomli chosen gene flybas subset medlin abstract drosophila result show precis top select sentenc aspect typic gener summari inform indic approach effect automat summar literatur inform gene gener summari directli biologist serv entri point enabl quickli digest retriev literatur articl robust pseudo feedback estim hmm passag extract uiuc trec genom track extract coher relev passag hidden markov model multilevel code channel duniform input rateless transmiss bsc code scheme channel nonuniform input nui standard linear block code appli directli show multilevel code mlc set linear code determinist mapper achiev inform rate channel nui mapper applic propos mlc scheme present rateless transmiss scheme binari symmetr channel bsc algebra soft ddecis decod reed dsolomon code bit dlevel soft inform perform algebra soft decis decod asd reed solomon rs code bit level soft inform investig optim multipl assign strategi ma asd infinit cost studi erasur channel binari symmetr channel bsc decod radii calcul close form tight bound error probabl deriv ma perform analysi gener character decod region asd mix error bit level erasur channel bit level decod region propos ma shown significantli larger convent berlekamp massei bm decod applic bit level gener minimum distanc bgmd decod algorithm propos propos bgmd compar favor rs soft decis decod sdd algorithm channel ow simplic bgmd perform tightli bound order statist greedi schedul perform dforc dirti dpaper code system accur extract coher relev passag hidden markov model perform analysi algebra soft decod reed dsolomon code binari symmetr erasur channel abstract paper character decod region algebra soft decod asd reed solomon rs code discret alphabet channel dac optim multipl assign strategi ma investig tight bound deriv show perform asd binari erasur channel bec binari symmetr channel bsc perform analysi suggest asd provid signific gain convent berlekamp massei bm decod analysi techniqu extend channel model rs code modul erasur channel result suggest potenti applic asd practic system iter soft input soft output decod reed dsolomon code adapt pariti check matrix abstract iter algorithm present soft inputsoft output siso decod reed solomon rs code propos iter algorithm sum product algorithm spa conjunct binari pariti check matrix rs code novelti reduc submatrix binari pariti check matrix correspond reliabl bit spars natur spa appli iter propos algorithm geometr interpret twostag gradient descent adapt potenti function adapt procedur crucial converg behavior gradient descent algorithm significantli improv perform simul result show propos decod algorithm variat provid signific gain hard decis decod hdd compar favor popular soft decis decod method index term adapt pariti check matrix gradient descent iter decod soft decis decod reed solomon rs code method measur cross section area vessel mri imag applic stenosi detect uiuc hard dpassag retriev hmm antenna divers multius data network global optim transmitt placement indoor wireless commun system direct divid rectangl algorithm variant lipschitzian method bound constrain global optim appli optim transmitt placement indoor wireless system power coverag ber bit error rate consid criteria optim locat number transmitt feasibl region design space perform direct implement applic depend characterist object function problem dimens desir solut accuraci implement static data structur fail practic unpredict memori requir critic site specif system simul wireless commun system direct optim small compon connect parallel propag rai trace model run node beowulf cluster linux workstat surrog function wcdma wideband code divis multipl access simul estim channel perform compon failur larg comput abort entir design process make direct global optim algorithm effici robust set dynam data structur propos balanc memori requir execut time simultan adapt arbitrari problem size focu design issu dynam data structur relat memori manag strategi applic issu direct algorithm transmitt placement optim wireless commun system result indoor system present demonstr effect present work integr pse wireless commun experi siteplann ae project adapt filter continu queri distribut data stream environ distribut data sourc continu stream updat central processor monitor continu queri distribut data signific commun overhead incur presenc rapid updat stream propos techniqu reduc overhead user regist continu queri precis requir central stream processor instal filter remot data sourc filter adapt chang condit minim stream rate guarante continu queri receiv updat provid answer adequ precis time approach enabl applic trade precis commun overhead fine granular individu adjust precis constraint continu queri stream multi queri workload bsml bind schema markup languag data interchang problem solv environ describ bind schema markup languag bsml describ data interchang scientif code facil import constitu scientif problem solv environ pse bsml design integr pse applic composit system view model specif execut problem manag semistructur data data interchang problem address techniqu process semistructur data valid bind convers present bsml describ applic pse wireless commun system design global optim design wireless commun system paper global optim techniqu appli solv optim transmitt placement problem indoor wireless system cient pattern search algorithm direct divid rectangl jone perttunen stuckman connect parallel radio propag rai trace model run node beowulf cluster linux workstat surrog function parallel wcdma wideband code divis multipl access simul estim system perform global optim algorithm power coverag ber bit error rate consid di erent criteria optim locat number transmitt feasibl region design space paper briefli describ underli radio propag wcdma simul focus design issu optim loop bsml bind schema markup languag data interchang problem solv environ pse 